About primitive recursive algorithms
نویسندگان
چکیده
منابع مشابه
A Representation Theorem for Primitive Recursive Algorithms
We formalize the algorithms computing primitive recursive (PR) functions as the abstract state machines (ASMs) whose running length is computable by a PR function. Then we show that there exists a programming language (implementing only PR functions) by which it is possible to implement any one of the previously defined algorithms for the PR functions in such a way that their complexity is pres...
متن کاملOn primitive recursive algorithms and the greatest common divisor function
We establish linear lower bounds for the complexity of non-trivial, primitive recursive algorithms from piecewise linear given functions. The main corollary is that logtime algorithms for the greatest common divisor from such givens (such as Stein’s) cannot be matched in efficiency by primitive recursive algorithms from the same given functions. The question is left open for the Euclidean algor...
متن کاملPrimitive Recursive Functions
1. Definition of recursive functions. In this paper, we shall consider certain reductions in the recursion scheme for defining primitive recursive functions. Hereafter, we shall refer to such functions simply as recursive functions. In §1, we define what is meant by a recursive function, and also define some recursive functions which will be used. The statement of the principal results of the p...
متن کاملExtended Primitive Recursive Functions
— In this paper we extend the notion of primitive recursive function to the case in which the domain is N* and the range is a subset oj N*. We give a rigorvus characterization oj tins class oj functions and show différences icith the classical primitive recursive functions. Résumé. — Dans cette note nous étendons la notion de f onction primitive recursive à tous les cas dans lesquels le domaine...
متن کاملUnary Primitive Recursive Functions
In this article, we will study certain reductions in the schemes that conform unary primitive recursive functions (i.e. primitive recursive functions of one argument) and we will extend some results previously researched by R. M. Robinson in [15]. Furthermore, we will introduce formal notation for unary primitive recursive functions. §
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90039-5